Betti Numbers of Monomial Ideals and Shifted Skew Shapes
نویسندگان
چکیده
We present two new problems on lower bounds for Betti numbers of the minimal free resolution for monomial ideals generated in a fixed degree. The first concerns any such ideal and bounds the total Betti numbers, while the second concerns ideals that are quadratic and bihomogeneous with respect to two variable sets, but gives a more finely graded lower bound. These problems are solved for certain classes of ideals that generalize (in two different directions) the edge ideals of threshold graphs and Ferrers graphs. In the process, we produce particularly simple cellular linear resolutions for strongly stable and squarefree strongly stable ideals generated in a fixed degree, and combinatorial interpretations for the Betti numbers of other classes of ideals, all of which are independent of the coefficient field. Partially supported by NSA grant H98230-07-1-0065 and by the Institute for Mathematics & its Applications at the University of Minnesota. Partially supported by NSF grant DMS-0601010. the electronic journal of combinatorics 16(2) (2009), #R3 1
منابع مشابه
Laplacians on Shifted Multicomplexes
The Laplacian of an undirected graph is a square matrix, whose eigenvalues yield important information. We can regard graphs as one-dimensional simplicial complexes, and as whether there is a generalisation of the Laplacian operator to simplicial complexes. It turns out that there is, and that is useful for calculating real Betti numbers [8]. Duval and Reiner [5] have studied Laplacians of a sp...
متن کاملOptimal Betti Numbers of Forest Ideals
We prove a tight lower bound on the algebraic Betti numbers of tree and forest ideals and an upper bound on certain graded Betti numbers of squarefree monomial ideals.
متن کاملSplittings of Monomial Ideals
We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire’s splitting approach. As applications, we show that edge ideals of graphs are splittable, and we provide an iterative method for computing the Betti numbers of the cover ideals of Cohen-Macaulay bi...
متن کاملComponentwise Linear Ideals with Minimal or Maximal Betti Numbers
We characterize componentwise linear monomial ideals with minimal Taylor resolution and consider the lower bound for the Betti numbers of componentwise linear ideals. INTRODUCTION Let S = K[x1, . . . ,xn] denote the polynomial ring in n variables over a field K with each degxi = 1. Let I be a monomial ideal of S and G(I) = {u1, . . . ,us} its unique minimal system of monomial generators. The Ta...
متن کاملar X iv : 0 80 7 . 21 85 v 1 [ m at h . A C ] 1 4 Ju l 2 00 8 SPLITTINGS OF MONOMIAL IDEALS
We provide some new conditions under which the graded Betti numbers of a mono-mial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire's splitting approach. As applications, we show that edge ideals of graphs are splittable, and we provide an iterative method for computing the Betti numbers of the cover ideals of Cohen-Macaulay b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 16 شماره
صفحات -
تاریخ انتشار 2009